Covering Random Points in a Unit Ball
نویسندگان
چکیده
Choose random pointsX1, X2, X3, . . . independently from a uniform distribution in a unit ball in <. Call Xn a dominator iff distance(Xn, Xi) ≤ 1 for all i < n, i.e. the first n points are all contained in the unit ball that is centered at the n’th point Xn. We prove that, with probability one, only finitely many of the points are dominators. For the special casem = 2, we consider the unit disk graph Gn determined by n random points X1, X2, . . . , Xn in the unit disk. With asymptotic probability one, Gn has a connected dominating set consisting of just two points. keywords and phrases: stochastic geometry, dominating set, geometric graph, unit ball graph
منابع مشابه
M ay 2 00 6 A limit theorem for the maximal interpoint distance of a random sample in the unit ball ∗
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit d-dimensional ball for d ≥ 2. The exact form of the limit distribution and the required normalisation are derived using assumptions on the tail of the interpoint distance for two i.i.d. points. The results are specialised for the cases when the points have sphe...
متن کاملA limit theorem for the maximal interpoint distance of a random sample in the unit ball ∗
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit d-dimensional ball for d ≥ 2. The exact form of the limit distribution and the required normalisation are derived using assumptions on the tail of the interpoint distance for two i.i.d. points. The results are specialised for the cases when the points have sphe...
متن کاملRandom Triangles III
Let Ω be a compact convex set in Euclidean n-space with nonempty interior. Random triangles are defined here by selecting three independent uniformly distributed points in Ω to be vertices. Generating such points for (n,Ω) = (2,unit square) or (n,Ω) = (3,unit cube) is straightforward. For (n,Ω) = (2,unit disk) or (n,Ω) = (3,unit ball), we use the following result [1]. Let X1, X2, X3, Y1, Y2, Y3...
متن کاملOn the Fractality of Complex Networks: Covering Problem, Algorithms and Ahlfors Regularity
In this paper, we revisit the fractality of complex network by investigating three dimensions with respect to minimum box-covering, minimum ball-covering and average volume of balls. The first two dimensions are calculated through the minimum box-covering problem and minimum ball-covering problem. For minimum ball-covering problem, we prove its NP-completeness and propose several heuristic algo...
متن کاملOn the 1-density of Unit Ball Covering
Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim sup) density of the volume which is covered by exactly one ball (i.e., the maximum such density over all unit ball covers, called the optimal 1-density and denoted as...
متن کامل